On semisymmetric cubic graphs of order 6p~2

A graph r is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Г) acting transitively on its edge set but not on its vertex set. In the case of G. = A, we call r a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p.     

Strongly Modular Subgroup in Finite Group

Ｓｔｒｏｎｇｌｙ　Ｍｏｄｕｌａｒ　Ｓｕｂｇｒｏｕｐ　ｉｎ　Ｆｉｎｉｔｅ　ＧｒｏｕｐＳｔｒｏｎｇｌｙＭｏｄｕｌａｒＳｕｂｇｒｏｕｐｉｎＦｉｎｉｔｅＧｒｏｕｐ￥ＹｕＪｉａｎｌｉ；ＪｉａｏＤｏｎｇｗｕ（ＬｕｏｙａｎｇＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｌｏｇ...     

ON THE SHEAF OF GENERALIZED FUNDAMENTAL GROUP AND COVERING SPACE

ＯＮ ＴＨＥ ＳＨＥＡＦ ＯＦ ＧＥＮＥＲＡＬＩＺＥＤ ＦＵＮＤＡＭＥＮＴＡＬ ＧＲＯＵＰ ＡＮＤ ＣＯＶＥＲＩＮＧ ＳＰＡＣＥ￥ＧＡＮＤＡＮＹＡＮＡｂｓｔｒａｃｔ：Ｔｈｅａｕｔｈｏｒｃｏｎｓｔｒｕｃｔｓｔｈｅｓｈｅａｆｏｆｇｅｎｅｒａｌｉｚｅｄｆｕ...     

Cyclic BSEC of block size 3

Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao and Stufken in 1988. In this note, we discuss constructions of these designs having cyclic automorphisms. We use Langford sequences to construct all possible cyclic BSEC (or CBSEC) with block size 3 and λ = 1,2, which establishes the necessary and sufficient conditions for such designs. Some constructions of the balanced sampling plan avoiding adjacent units, a generalization of BSEC, are also given for fixed λ.     

A New Algorithm for Solving the Word Problem in Braid Groups

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topological point of view (rather than a geometric one). The braid group is defined by the action of diffeomorphisms on the fundamental group of a punctured disk. We exploit the topological definition in order to give a new approach for solving its word problem. Our algorithm, although not better in complexity, is faster in comparison with known algorithms for short braid words, and it is almost independent of the number of strings in the braids. Moreover, the algorithm is based on a new computer presentation of the elements of the fundamental group of a punctured disk. This presentation can be used also for other algorithms.     

Interdiffusion of hydroxyl groups and of doping additions between a bearing pipe and a deposited layer in billets of fiber light guides

Using Raman spectroscopy, a quantitative analysis of the distribution of OH⁻ ions on the boundary between a bearing pipe and a glass layer deposited from chlorides in billets for quartz fiber light guides is carried out. Water penetrated into the light-reflecting shell to a depth of several tenths of a millimeter, depending on the composition of the doping layer (i.e., ultimately on the temperature of the depsoition process). A. F. Ioffe Physical-Technical Institute, Academy of Sciences of Russia, 26, Politekhnicheskaya St., St. Petersburg, 194021, Russia. Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 64, No. 4, pp. 548–550, July–August, 1997.